Context semantics, linear logic, and computational complexity
نویسندگان
چکیده
منابع مشابه
On the Computational Complexity of Cut-Elimination in Linear Logic
Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same normal form. This decision problem has been shown to be ptime-complete for Multiplicative Linear Logic (Mairson 2003). The latter result depends upon a restricted simulation of weakening and contraction for boolean values in MLL; ...
متن کاملOrdered Epistemic Logic: Semantics, Complexity and Applications
Many examples of epistemic reasoning in the literature exhibit a stratified structure: defaults are formulated on top of an incomplete knowledge base. These defaults derive extra information in case information is missing in the knowledge base. In autoepistemic logic, default logic and ASP this inherent stratification is not preserved as they may refer to their own knowledge or logical conseque...
متن کاملAbduction from Logic Programs: Semantics and Complexity
Abduction ~ from observations and a theory, find using hypotheses an explanation for the observations gained increasing interest during the last years. This form of reasoning has wide applicability in different areas of computer science; in particular, it has been recognized as an important principle of common-sense reasoning. In this paper, we define a general abduction model for logic program...
متن کاملProfunctor Semantics for Linear Logic
Linear logic is a sort of “resource-aware” logic underlying intuitionistic logic. Investigations into the proof theory of this logic typically revolve around proof nets, certain two-dimensional graphical representations of proofs. Where sequent calculus deductions enforce arbitrary distinctions between proofs and complicate these investigations, proof nets represent sequent calculus deductions ...
متن کاملQuantum Computation, Categorical Semantics and Linear Logic
We develop a type theory and provide a denotational semantics for a simple fragment of the quantum lambda calculus, a formal language for quantum computation based on linear logic. In our semantics, variables inhabit certain Hilbert bundles, and computations are interpreted as the appropriate inner product preserving maps between Hilbert bundles. These bundles and maps form a symmetric monoidal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2009
ISSN: 1529-3785,1557-945X
DOI: 10.1145/1555746.1555749